The spectral dimension of random brushesJONSSON, Thordur; ÖRN STEFANSSON, Sigurour.Journal of physics. A, Mathematical and theoretical (Print). 2008, Vol 41, Num 4, issn 1751-8113, 045005.1-045005.10Article

A comparative analysis of the performance of Taguchi's linear graphs for the design of two-level fractional factorialsBISGAARD, S.Applied statistics. 1996, Vol 45, Num 3, pp 311-322, issn 0035-9254Article

The random linear bottleneck assignment problemPFERSCHY, U.RAIRO. Recherche opérationnelle. 1996, Vol 30, Num 2, pp 127-142, issn 0399-0559Article

A geometric growth model interpolating between regular and small-world networksZHONGZHI ZHANG; SHUIGENG ZHOU; ZHIYONG WANG et al.Journal of physics. A, Mathematical and theoretical (Print). 2007, Vol 40, Num 39, pp 11863-11876, issn 1751-8113, 14 p.Article

Pre-processing and linear-decomposition algorithm to solve the k-colorability problemLUCET, Corinne; MENDES, Florence; MOUKRIM, Aziz et al.Lecture notes in computer science. 2004, pp 315-325, issn 0302-9743, isbn 3-540-22067-4, 11 p.Conference Paper

An O(n) time algorithm for maximum matching in P₄-tidy graphsFOUQUET, J. L; PARFENOFF, I; THUILLIER, H et al.Information processing letters. 1997, Vol 62, Num 6, pp 281-287, issn 0020-0190Article

More on rectangles tiles by rectanglesMEAD, D. G; STEIN, S. K.The American mathematical monthly. 1993, Vol 100, Num 7, pp 641-643, issn 0002-9890Article

On distance-preserving and domination elimination orderingsCHEPOI, V.SIAM journal on discrete mathematics (Print). 1998, Vol 11, Num 3, pp 414-436, issn 0895-4801Article

Improving Taguchi's packaging of fractional factorial designsROBINSON, G. K.Journal of quality technology. 1993, Vol 25, Num 1, pp 1-11, issn 0022-4065Article

Adding an edge in a cographNIKOLOPOULOS, Stavros D; PALIOS, Leonidas.Lecture notes in computer science. 2005, pp 214-226, issn 0302-9743, isbn 3-540-31000-2, 1Vol, 13 p.Conference Paper

A conjecture of Berge about linear hypergraphs and Steiner systems S(2,4,v)GIONFRIDDO, Lucia.Discrete mathematics. 2002, Vol 255, Num 1-3, pp 125-133, issn 0012-365XConference Paper

A coding approach to signed graphsSOLE, P; ZASLAVSKY, T.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 4, pp 544-553, issn 0895-4801Article

An O(n + m) Certifying Triconnnectivity Algorithm for Hamiltonian GraphsELMASRY, Amr; MEHLHORN, Kurt; SCHMIDT, Jens M et al.Algorithmica. 2012, Vol 62, Num 3-4, pp 754-766, issn 0178-4617, 13 p.Article

On a cycle through a specified linear forest of a graphGERLACH, Tobias; HARANT, Jochen.Discrete mathematics. 2007, Vol 307, Num 7-8, pp 892-895, issn 0012-365X, 4 p.Conference Paper

The vertex linear arboricity of distance graphsZUO, Lian-Cui; WU, Jia-Liang; LIU, Jia-Zhuang et al.Discrete mathematics. 2006, Vol 306, Num 2, pp 284-289, issn 0012-365X, 6 p.Article

An implicit representation of chordal comparabilty graphs in linear-timeCURTIS, Andrew R; IZURIETA, Clemente; JOERIS, Benson et al.Lecture notes in computer science. 2006, pp 168-178, issn 0302-9743, isbn 3-540-48381-0, 11 p.Conference Paper

Bounds on codes derived by counting components in Varshamov graphsO'BRIEN, Katie; FITZPATRICK, Patrick.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 487Conference Paper

Simple MAX-CUT for split-indifference graphs and graphs with few P₄'sBODLAENDER, Hans L; DE FIGUEIREDO, Celina M. H; GUTIERREZ, Marisa et al.Lecture notes in computer science. 2004, pp 87-99, issn 0302-9743, isbn 3-540-22067-4, 13 p.Conference Paper

The linear arrangement problem on recursively constructed graphsHORTON, S. B; EASTON, T; PARKER, R. Gary et al.Networks (New York, NY). 2003, Vol 42, Num 3, pp 165-168, issn 0028-3045, 4 p.Article

On the linear k-arboricity of K_n and K_{n, n}CHEN, Bor-Liang; HUANG, Kuo-Ching.Discrete mathematics. 2002, Vol 254, Num 1-3, pp 51-61, issn 0012-365XArticle

A simple linear time algorithm for proper box rectangular drawings of plane graphsXIN HE.Lecture notes in computer science. 2001, pp 234-245, issn 0302-9743, isbn 3-540-42423-7Conference Paper

A graph-aided method for planning two-level experiments when certain interactions are importantWU, C. F. J; YOUYI CHEN.Technometrics. 1992, Vol 34, Num 2, pp 162-175, issn 0040-1706Article

Use of linear graphs in the analysis of spin diffusion in NOE spectra of macromoleculesMAJUMDAR, A.Journal of magnetic resonance. 1991, Vol 95, Num 1, pp 118-131, issn 0022-2364Article

THE LINEAR ARBORICITY OF GRAPHS ON SURFACES OF NEGATIVE EULER CHARACTERISTICWU, Jian-Liang.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 1, pp 54-58, issn 0895-4801, 5 p.Article

Maximal models of assertion graph in GSTEGUOWU YANG; JIN YANG; XIAOYU SONG et al.Lecture notes in computer science. 2006, pp 684-693, issn 0302-9743, isbn 3-540-34021-1, 1Vol, 10 p.Conference Paper